TSTP Solution File: PUZ085^1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : PUZ085^1 : TPTP v8.1.2. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n029.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 13:13:19 EDT 2023
% Result : CounterSatisfiable 35.71s 35.97s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.15 % Problem : PUZ085^1 : TPTP v8.1.2. Released v4.0.0.
% 0.00/0.16 % Command : do_cvc5 %s %d
% 0.17/0.38 % Computer : n029.cluster.edu
% 0.17/0.38 % Model : x86_64 x86_64
% 0.17/0.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.38 % Memory : 8042.1875MB
% 0.17/0.38 % OS : Linux 3.10.0-693.el7.x86_64
% 0.17/0.38 % CPULimit : 300
% 0.17/0.38 % WCLimit : 300
% 0.17/0.38 % DateTime : Sat Aug 26 22:16:55 EDT 2023
% 0.17/0.38 % CPUTime :
% 0.24/0.54 %----Proving TH0
% 0.24/0.54 %------------------------------------------------------------------------------
% 0.24/0.54 % File : PUZ085^1 : TPTP v8.1.2. Released v4.0.0.
% 0.24/0.54 % Domain : Logic Calculi (Espistemic logic)
% 0.24/0.54 % Problem : The friends puzzle - transitivity for Peter's wife
% 0.24/0.54 % Version : [Ben09] axioms.
% 0.24/0.54 % English : (i) Peter is a friend of John, so if Peter knows that John knows
% 0.24/0.54 % something then John knows that Peter knows the same thing.
% 0.24/0.54 % (ii) Peter is married, so if Peter's wife knows something, then
% 0.24/0.54 % Peter knows the same thing. John and Peter have an appointment,
% 0.24/0.54 % let us consider the following situation: (a) Peter knows the time
% 0.24/0.54 % of their appointment. (b) Peter also knows that John knows the
% 0.24/0.54 % place of their appointment. Moreover, (c) Peter's wife knows that
% 0.24/0.54 % if Peter knows the time of their appointment, then John knows
% 0.24/0.54 % that too (since John and Peter are friends). Finally, (d) Peter
% 0.24/0.54 % knows that if John knows the place and the time of their
% 0.24/0.54 % appointment, then John knows that he has an appointment. From
% 0.24/0.54 % this situation we want to prove (e) that each of the two friends
% 0.24/0.54 % knows that the other one knows that he has an appointment.
% 0.24/0.54
% 0.24/0.54 % Refs : [Gol92] Goldblatt (1992), Logics of Time and Computation
% 0.24/0.54 % : [Bal98] Baldoni (1998), Normal Multimodal Logics: Automatic De
% 0.24/0.54 % : [Ben09] Benzmueller (2009), Email to Geoff Sutcliffe
% 0.24/0.54 % Source : [Ben09]
% 0.24/0.54 % Names : mmex2.p [Ben09]
% 0.24/0.54
% 0.24/0.54 % Status : Theorem
% 0.24/0.54 % Rating : 0.23 v8.1.0, 0.18 v7.5.0, 0.14 v7.4.0, 0.11 v7.2.0, 0.00 v7.1.0, 0.25 v7.0.0, 0.14 v6.4.0, 0.17 v6.3.0, 0.20 v6.2.0, 0.14 v5.5.0, 0.17 v5.4.0, 0.20 v5.3.0, 0.40 v5.2.0, 0.20 v5.1.0, 0.40 v5.0.0, 0.20 v4.1.0, 0.33 v4.0.0
% 0.24/0.54 % Syntax : Number of formulae : 73 ( 31 unt; 35 typ; 31 def)
% 0.24/0.54 % Number of atoms : 118 ( 36 equ; 0 cnn)
% 0.24/0.54 % Maximal formula atoms : 12 ( 3 avg)
% 0.24/0.54 % Number of connectives : 144 ( 4 ~; 4 |; 8 &; 120 @)
% 0.24/0.54 % ( 0 <=>; 8 =>; 0 <=; 0 <~>)
% 0.24/0.54 % Maximal formula depth : 9 ( 1 avg)
% 0.24/0.54 % Number of types : 3 ( 1 usr)
% 0.24/0.54 % Number of type conns : 178 ( 178 >; 0 *; 0 +; 0 <<)
% 0.24/0.54 % Number of symbols : 42 ( 40 usr; 7 con; 0-3 aty)
% 0.24/0.54 % Number of variables : 85 ( 50 ^; 29 !; 6 ?; 85 :)
% 0.24/0.54 % SPC : TH0_THM_EQU_NAR
% 0.24/0.54
% 0.24/0.54 % Comments :
% 0.24/0.54 %------------------------------------------------------------------------------
% 0.24/0.54 %----Include embedding of quantified multimodal logic in simple type theory
% 0.24/0.54 %------------------------------------------------------------------------------
% 0.24/0.54 %----Declaration of additional base type mu
% 0.24/0.54 thf(mu_type,type,
% 0.24/0.54 mu: $tType ).
% 0.24/0.54
% 0.24/0.54 %----Equality
% 0.24/0.54 thf(meq_ind_type,type,
% 0.24/0.54 meq_ind: mu > mu > $i > $o ).
% 0.24/0.54
% 0.24/0.54 thf(meq_ind,definition,
% 0.24/0.54 ( meq_ind
% 0.24/0.54 = ( ^ [X: mu,Y: mu,W: $i] : ( X = Y ) ) ) ).
% 0.24/0.54
% 0.24/0.54 thf(meq_prop_type,type,
% 0.24/0.54 meq_prop: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.24/0.54
% 0.24/0.54 thf(meq_prop,definition,
% 0.24/0.54 ( meq_prop
% 0.24/0.54 = ( ^ [X: $i > $o,Y: $i > $o,W: $i] :
% 0.24/0.54 ( ( X @ W )
% 0.24/0.54 = ( Y @ W ) ) ) ) ).
% 0.24/0.54
% 0.24/0.54 %----Modal operators not, or, box, Pi
% 0.24/0.54 thf(mnot_type,type,
% 0.24/0.54 mnot: ( $i > $o ) > $i > $o ).
% 0.24/0.54
% 0.24/0.54 thf(mnot,definition,
% 0.24/0.54 ( mnot
% 0.24/0.54 = ( ^ [Phi: $i > $o,W: $i] :
% 0.24/0.54 ~ ( Phi @ W ) ) ) ).
% 0.24/0.54
% 0.24/0.54 thf(mor_type,type,
% 0.24/0.54 mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.24/0.54
% 0.24/0.54 thf(mor,definition,
% 0.24/0.54 ( mor
% 0.24/0.54 = ( ^ [Phi: $i > $o,Psi: $i > $o,W: $i] :
% 0.24/0.54 ( ( Phi @ W )
% 0.24/0.54 | ( Psi @ W ) ) ) ) ).
% 0.24/0.54
% 0.24/0.54 thf(mand_type,type,
% 0.24/0.54 mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.24/0.54
% 0.24/0.54 thf(mand,definition,
% 0.24/0.54 ( mand
% 0.24/0.54 = ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mnot @ ( mor @ ( mnot @ Phi ) @ ( mnot @ Psi ) ) ) ) ) ).
% 0.24/0.54
% 0.24/0.54 thf(mimplies_type,type,
% 0.24/0.54 mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.24/0.54
% 0.24/0.54 thf(mimplies,definition,
% 0.24/0.54 ( mimplies
% 0.24/0.54 = ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mor @ ( mnot @ Phi ) @ Psi ) ) ) ).
% 0.24/0.54
% 0.24/0.54 thf(mimplied_type,type,
% 0.24/0.54 mimplied: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.24/0.54
% 0.24/0.54 thf(mimplied,definition,
% 0.24/0.54 ( mimplied
% 0.24/0.54 = ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mor @ ( mnot @ Psi ) @ Phi ) ) ) ).
% 0.24/0.54
% 0.24/0.54 thf(mequiv_type,type,
% 0.24/0.54 mequiv: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.24/0.54
% 0.24/0.54 thf(mequiv,definition,
% 0.24/0.54 ( mequiv
% 0.24/0.54 = ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mand @ ( mimplies @ Phi @ Psi ) @ ( mimplies @ Psi @ Phi ) ) ) ) ).
% 0.24/0.54
% 0.24/0.54 thf(mxor_type,type,
% 0.24/0.54 mxor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.24/0.54
% 0.24/0.54 thf(mxor,definition,
% 0.24/0.54 ( mxor
% 0.24/0.54 = ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mnot @ ( mequiv @ Phi @ Psi ) ) ) ) ).
% 0.24/0.54
% 0.24/0.54 %----Universal quantification: individuals
% 0.24/0.54 thf(mforall_ind_type,type,
% 0.24/0.54 mforall_ind: ( mu > $i > $o ) > $i > $o ).
% 0.24/0.54
% 0.24/0.54 thf(mforall_ind,definition,
% 0.24/0.54 ( mforall_ind
% 0.24/0.54 = ( ^ [Phi: mu > $i > $o,W: $i] :
% 0.24/0.54 ! [X: mu] : ( Phi @ X @ W ) ) ) ).
% 0.24/0.54
% 0.24/0.54 thf(mforall_prop_type,type,
% 0.24/0.54 mforall_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
% 0.24/0.54
% 0.24/0.54 thf(mforall_prop,definition,
% 0.24/0.54 ( mforall_prop
% 0.24/0.54 = ( ^ [Phi: ( $i > $o ) > $i > $o,W: $i] :
% 0.24/0.54 ! [P: $i > $o] : ( Phi @ P @ W ) ) ) ).
% 0.24/0.54
% 0.24/0.54 thf(mexists_ind_type,type,
% 0.24/0.54 mexists_ind: ( mu > $i > $o ) > $i > $o ).
% 0.24/0.54
% 0.24/0.54 thf(mexists_ind,definition,
% 0.24/0.54 ( mexists_ind
% 0.24/0.54 = ( ^ [Phi: mu > $i > $o] :
% 0.24/0.54 ( mnot
% 0.24/0.54 @ ( mforall_ind
% 0.24/0.54 @ ^ [X: mu] : ( mnot @ ( Phi @ X ) ) ) ) ) ) ).
% 0.24/0.54
% 0.24/0.54 thf(mexists_prop_type,type,
% 0.24/0.54 mexists_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
% 0.24/0.54
% 0.24/0.54 thf(mexists_prop,definition,
% 0.24/0.54 ( mexists_prop
% 0.24/0.54 = ( ^ [Phi: ( $i > $o ) > $i > $o] :
% 0.24/0.54 ( mnot
% 0.24/0.54 @ ( mforall_prop
% 0.24/0.54 @ ^ [P: $i > $o] : ( mnot @ ( Phi @ P ) ) ) ) ) ) ).
% 0.24/0.54
% 0.24/0.54 thf(mtrue_type,type,
% 0.24/0.54 mtrue: $i > $o ).
% 0.24/0.54
% 0.24/0.54 thf(mtrue,definition,
% 0.24/0.54 ( mtrue
% 0.24/0.54 = ( ^ [W: $i] : $true ) ) ).
% 0.24/0.54
% 0.24/0.54 thf(mfalse_type,type,
% 0.24/0.54 mfalse: $i > $o ).
% 0.24/0.54
% 0.24/0.54 thf(mfalse,definition,
% 0.24/0.54 ( mfalse
% 0.24/0.54 = ( mnot @ mtrue ) ) ).
% 0.24/0.54
% 0.24/0.54 thf(mbox_type,type,
% 0.24/0.54 mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.24/0.54
% 0.24/0.54 thf(mbox,definition,
% 0.24/0.54 ( mbox
% 0.24/0.54 = ( ^ [R: $i > $i > $o,Phi: $i > $o,W: $i] :
% 0.24/0.54 ! [V: $i] :
% 0.24/0.54 ( ~ ( R @ W @ V )
% 0.24/0.54 | ( Phi @ V ) ) ) ) ).
% 0.24/0.54
% 0.24/0.54 thf(mdia_type,type,
% 0.24/0.54 mdia: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.24/0.55
% 0.24/0.55 thf(mdia,definition,
% 0.24/0.55 ( mdia
% 0.24/0.55 = ( ^ [R: $i > $i > $o,Phi: $i > $o] : ( mnot @ ( mbox @ R @ ( mnot @ Phi ) ) ) ) ) ).
% 0.24/0.55
% 0.24/0.55 %----Definition of properties of accessibility relations
% 0.24/0.55 thf(mreflexive_type,type,
% 0.24/0.55 mreflexive: ( $i > $i > $o ) > $o ).
% 0.24/0.55
% 0.24/0.55 thf(mreflexive,definition,
% 0.24/0.55 ( mreflexive
% 0.24/0.55 = ( ^ [R: $i > $i > $o] :
% 0.24/0.55 ! [S: $i] : ( R @ S @ S ) ) ) ).
% 0.24/0.55
% 0.24/0.55 thf(msymmetric_type,type,
% 0.24/0.55 msymmetric: ( $i > $i > $o ) > $o ).
% 0.24/0.55
% 0.24/0.55 thf(msymmetric,definition,
% 0.24/0.55 ( msymmetric
% 0.24/0.55 = ( ^ [R: $i > $i > $o] :
% 0.24/0.55 ! [S: $i,T: $i] :
% 0.24/0.55 ( ( R @ S @ T )
% 0.24/0.55 => ( R @ T @ S ) ) ) ) ).
% 0.24/0.55
% 0.24/0.55 thf(mserial_type,type,
% 0.24/0.55 mserial: ( $i > $i > $o ) > $o ).
% 0.24/0.55
% 0.24/0.55 thf(mserial,definition,
% 0.24/0.55 ( mserial
% 0.24/0.55 = ( ^ [R: $i > $i > $o] :
% 0.24/0.55 ! [S: $i] :
% 0.24/0.55 ? [T: $i] : ( R @ S @ T ) ) ) ).
% 0.24/0.55
% 0.24/0.55 thf(mtransitive_type,type,
% 0.24/0.55 mtransitive: ( $i > $i > $o ) > $o ).
% 0.24/0.55
% 0.24/0.55 thf(mtransitive,definition,
% 0.24/0.55 ( mtransitive
% 0.24/0.55 = ( ^ [R: $i > $i > $o] :
% 0.24/0.55 ! [S: $i,T: $i,U: $i] :
% 0.24/0.55 ( ( ( R @ S @ T )
% 0.24/0.55 & ( R @ T @ U ) )
% 0.24/0.55 => ( R @ S @ U ) ) ) ) ).
% 0.24/0.55
% 0.24/0.55 thf(meuclidean_type,type,
% 0.24/0.55 meuclidean: ( $i > $i > $o ) > $o ).
% 0.24/0.55
% 0.24/0.55 thf(meuclidean,definition,
% 0.24/0.55 ( meuclidean
% 0.24/0.55 = ( ^ [R: $i > $i > $o] :
% 0.24/0.55 ! [S: $i,T: $i,U: $i] :
% 0.24/0.55 ( ( ( R @ S @ T )
% 0.24/0.55 & ( R @ S @ U ) )
% 0.24/0.55 => ( R @ T @ U ) ) ) ) ).
% 0.24/0.55
% 0.24/0.55 thf(mpartially_functional_type,type,
% 0.24/0.55 mpartially_functional: ( $i > $i > $o ) > $o ).
% 0.24/0.55
% 0.24/0.55 thf(mpartially_functional,definition,
% 0.24/0.55 ( mpartially_functional
% 0.24/0.55 = ( ^ [R: $i > $i > $o] :
% 0.24/0.55 ! [S: $i,T: $i,U: $i] :
% 0.24/0.55 ( ( ( R @ S @ T )
% 0.24/0.55 & ( R @ S @ U ) )
% 0.24/0.55 => ( T = U ) ) ) ) ).
% 0.24/0.55
% 0.24/0.55 thf(mfunctional_type,type,
% 0.24/0.55 mfunctional: ( $i > $i > $o ) > $o ).
% 0.24/0.55
% 0.24/0.55 thf(mfunctional,definition,
% 0.24/0.55 ( mfunctional
% 0.24/0.55 = ( ^ [R: $i > $i > $o] :
% 0.24/0.55 ! [S: $i] :
% 0.24/0.55 ? [T: $i] :
% 0.24/0.55 ( ( R @ S @ T )
% 0.24/0.55 & ! [U: $i] :
% 0.24/0.55 ( ( R @ S @ U )
% 0.24/0.55 => ( T = U ) ) ) ) ) ).
% 0.24/0.55
% 0.24/0.55 thf(mweakly_dense_type,type,
% 0.24/0.55 mweakly_dense: ( $i > $i > $o ) > $o ).
% 0.24/0.55
% 0.24/0.55 thf(mweakly_dense,definition,
% 0.24/0.55 ( mweakly_dense
% 0.24/0.56 = ( ^ [R: $i > $i > $o] :
% 0.24/0.56 ! [S: $i,T: $i,U: $i] :
% 0.24/0.56 ( ( R @ S @ T )
% 0.24/0.56 => ? [U: $i] :
% 0.24/0.56 ( ( R @ S @ U )
% 0.24/0.56 & ( R @ U @ T ) ) ) ) ) ).
% 0.24/0.56
% 0.24/0.56 thf(mweakly_connected_type,type,
% 0.24/0.56 mweakly_connected: ( $i > $i > $o ) > $o ).
% 0.24/0.56
% 0.24/0.56 thf(mweakly_connected,definition,
% 0.24/0.56 ( mweakly_connected
% 0.24/0.56 = ( ^ [R: $i > $i > $o] :
% 0.24/0.56 ! [S: $i,T: $i,U: $i] :
% 0.24/0.56 ( ( ( R @ S @ T )
% 0.24/0.56 & ( R @ S @ U ) )
% 0.24/0.56 => ( ( R @ T @ U )
% 0.24/0.56 | ( T = U )
% 0.24/0.56 | ( R @ U @ T ) ) ) ) ) ).
% 0.24/0.56
% 0.24/0.56 thf(mweakly_directed_type,type,
% 0.24/0.56 mweakly_directed: ( $i > $i > $o ) > $o ).
% 0.24/0.56
% 0.24/0.56 thf(mweakly_directed,definition,
% 0.24/0.56 ( mweakly_directed
% 0.24/0.56 = ( ^ [R: $i > $i > $o] :
% 0.24/0.56 ! [S: $i,T: $i,U: $i] :
% 0.24/0.56 ( ( ( R @ S @ T )
% 0.24/0.56 & ( R @ S @ U ) )
% 0.24/0.56 => ? [V: $i] :
% 0.24/0.56 ( ( R @ T @ V )
% 0.24/0.56 & ( R @ U @ V ) ) ) ) ) ).
% 0.24/0.56
% 0.24/0.56 %----Definition of validity
% 0.24/0.56 thf(mvalid_type,type,
% 0.24/0.56 mvalid: ( $i > $o ) > $o ).
% 0.24/0.56
% 0.24/0.56 thf(mvalid,definition,
% 0.24/0.56 ( mvalid
% 0.24/0.56 = ( ^ [Phi: $i > $o] :
% 0.24/0.56 ! [W: $i] : ( Phi @ W ) ) ) ).
% 0.24/0.56
% 0.24/0.56 %----Definition of invalidity
% 0.24/0.56 thf(minvalid_type,type,
% 0.24/0.56 minvalid: ( $i > $o ) > $o ).
% 0.24/0.56
% 0.24/0.56 thf(minvalid,definition,
% 0.24/0.56 ( minvalid
% 0.24/0.56 = ( ^ [Phi: $i > $o] :
% 0.24/0.56 ! [W: $i] :
% 0.24/0.56 ~ ( Phi @ W ) ) ) ).
% 0.24/0.56
% 0.24/0.56 %----Definition of satisfiability
% 0.24/0.56 thf(msatisfiable_type,type,
% 0.24/0.56 msatisfiable: ( $i > $o ) > $o ).
% 0.24/0.56
% 0.24/0.56 thf(msatisfiable,definition,
% 0.24/0.56 ( msatisfiable
% 0.24/0.56 = ( ^ [Phi: $i > $o] :
% 0.24/0.56 ? [W: $i] : ( Phi @ W ) ) ) ).
% 0.24/0.56
% 0.24/0.56 %----Definition of countersatisfiability
% 0.24/0.56 thf(mcountersatisfiable_type,type,
% 0.24/0.56 mcountersatisfiable: ( $i > $o ) > $o ).
% 0.24/0.56
% 0.24/0.56 thf(mcountersatisfiable,definition,
% 0.24/0.56 ( mcountersatisfiable
% 0.24/0.56 = ( ^ [Phi: $i > $o] :
% 0.24/0.56 ? [W: $i] :
% 0.24/0.56 ~ ( Phi @ W ) ) ) ).
% 0.24/0.56
% 0.24/0.56 %------------------------------------------------------------------------------
% 0.24/0.56 %------------------------------------------------------------------------------
% 0.24/0.56 thf(peter,type,
% 0.24/0.56 peter: $i > $i > $o ).
% 0.24/0.56
% 0.24/0.56 thf(john,type,
% 0.24/0.56 john: $i > $i > $o ).
% 0.24/0.56
% 0.24/0.56 thf(wife,type,
% 0.24/0.56 wife: ( $i > $i > $o ) > $i > $i > $o ).
% 0.24/0.56
% 0.24/0.56 thf(refl_peter,axiom,
% 0.24/0.56 mreflexive @ peter ).
% 0.24/0.56
% 0.24/0.56 thf(refl_john,axiom,
% 0.24/0.56 mreflexive @ john ).
% 0.24/0.56
% 0.24/0.56 thf(refl_wife_peter,axiom,
% 0.24/0.56 mreflexive @ ( wife @ peter ) ).
% 0.24/0.56
% 0.24/0.56 thf(trans_peter,axiom,
% 0.24/0.56 mtransitive @ peter ).
% 0.24/0.56
% 0.24/0.56 thf(trans_john,axiom,
% 0.24/0.56 mtransitive @ john ).
% 0.24/0.56
% 0.24/0.56 thf(trans_wife_peter,axiom,
% 0.24/0.56 mtransitive @ ( wife @ peter ) ).
% 0.24/0.56
% 0.24/0.56 thf(conj,conjecture,
% 0.24/0.56 ( mvalid
% 0.24/0.56 @ ( mforall_prop
% 0.24/0.56 @ ^ [A: $i > $o] : ( mimplies @ ( mbox @ ( wife @ peter ) @ A ) @ ( mbox @ ( wife @ peter ) @ ( mbox @ ( wife @ peter ) @ A ) ) ) ) ) ).
% 0.24/0.56
% 0.24/0.56 %------------------------------------------------------------------------------
% 0.24/0.56 ------- convert to smt2 : /export/starexec/sandbox2/tmp/tmp.aCX4xFbIXf/cvc5---1.0.5_15389.p...
% 0.24/0.56 (declare-sort $$unsorted 0)
% 0.24/0.56 (declare-sort tptp.mu 0)
% 0.24/0.56 (declare-fun tptp.meq_ind (tptp.mu tptp.mu $$unsorted) Bool)
% 0.24/0.56 (assert (= tptp.meq_ind (lambda ((X tptp.mu) (Y tptp.mu) (W $$unsorted)) (= X Y))))
% 0.24/0.56 (declare-fun tptp.meq_prop ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.24/0.56 (assert (= tptp.meq_prop (lambda ((X (-> $$unsorted Bool)) (Y (-> $$unsorted Bool)) (W $$unsorted)) (= (@ X W) (@ Y W)))))
% 0.24/0.56 (declare-fun tptp.mnot ((-> $$unsorted Bool) $$unsorted) Bool)
% 0.24/0.56 (assert (= tptp.mnot (lambda ((Phi (-> $$unsorted Bool)) (W $$unsorted)) (not (@ Phi W)))))
% 0.24/0.56 (declare-fun tptp.mor ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.24/0.56 (assert (= tptp.mor (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (W $$unsorted)) (or (@ Phi W) (@ Psi W)))))
% 0.24/0.56 (declare-fun tptp.mand ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.24/0.56 (assert (= tptp.mand (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ (@ tptp.mor (@ tptp.mnot Phi)) (@ tptp.mnot Psi))) __flatten_var_0))))
% 0.24/0.56 (declare-fun tptp.mimplies ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.24/0.56 (assert (= tptp.mimplies (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mor (@ tptp.mnot Phi)) Psi) __flatten_var_0))))
% 0.24/0.56 (declare-fun tptp.mimplied ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.24/0.56 (assert (= tptp.mimplied (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mor (@ tptp.mnot Psi)) Phi) __flatten_var_0))))
% 0.24/0.56 (declare-fun tptp.mequiv ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.24/0.56 (assert (= tptp.mequiv (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mand (@ (@ tptp.mimplies Phi) Psi)) (@ (@ tptp.mimplies Psi) Phi)) __flatten_var_0))))
% 0.24/0.56 (declare-fun tptp.mxor ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.24/0.56 (assert (= tptp.mxor (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ (@ tptp.mequiv Phi) Psi)) __flatten_var_0))))
% 0.24/0.56 (declare-fun tptp.mforall_ind ((-> tptp.mu $$unsorted Bool) $$unsorted) Bool)
% 0.24/0.56 (assert (= tptp.mforall_ind (lambda ((Phi (-> tptp.mu $$unsorted Bool)) (W $$unsorted)) (forall ((X tptp.mu)) (@ (@ Phi X) W)))))
% 0.24/0.56 (declare-fun tptp.mforall_prop ((-> (-> $$unsorted Bool) $$unsorted Bool) $$unsorted) Bool)
% 0.24/0.56 (assert (= tptp.mforall_prop (lambda ((Phi (-> (-> $$unsorted Bool) $$unsorted Bool)) (W $$unsorted)) (forall ((P (-> $$unsorted Bool))) (@ (@ Phi P) W)))))
% 0.24/0.56 (declare-fun tptp.mexists_ind ((-> tptp.mu $$unsorted Bool) $$unsorted) Bool)
% 0.24/0.56 (assert (= tptp.mexists_ind (lambda ((Phi (-> tptp.mu $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ tptp.mforall_ind (lambda ((X tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ Phi X)) __flatten_var_0)))) __flatten_var_0))))
% 0.24/0.56 (declare-fun tptp.mexists_prop ((-> (-> $$unsorted Bool) $$unsorted Bool) $$unsorted) Bool)
% 0.24/0.56 (assert (= tptp.mexists_prop (lambda ((Phi (-> (-> $$unsorted Bool) $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ tptp.mforall_prop (lambda ((P (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ Phi P)) __flatten_var_0)))) __flatten_var_0))))
% 0.24/0.56 (declare-fun tptp.mtrue ($$unsorted) Bool)
% 0.24/0.56 (assert (= tptp.mtrue (lambda ((W $$unsorted)) true)))
% 0.24/0.56 (declare-fun tptp.mfalse ($$unsorted) Bool)
% 0.24/0.56 (assert (= tptp.mfalse (@ tptp.mnot tptp.mtrue)))
% 0.24/0.56 (declare-fun tptp.mbox ((-> $$unsorted $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.24/0.56 (assert (= tptp.mbox (lambda ((R (-> $$unsorted $$unsorted Bool)) (Phi (-> $$unsorted Bool)) (W $$unsorted)) (forall ((V $$unsorted)) (or (not (@ (@ R W) V)) (@ Phi V))))))
% 0.24/0.56 (declare-fun tptp.mdia ((-> $$unsorted $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.24/0.56 (assert (= tptp.mdia (lambda ((R (-> $$unsorted $$unsorted Bool)) (Phi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ (@ tptp.mbox R) (@ tptp.mnot Phi))) __flatten_var_0))))
% 0.24/0.56 (declare-fun tptp.mreflexive ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.24/0.56 (assert (= tptp.mreflexive (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted)) (@ (@ R S) S)))))
% 0.24/0.56 (declare-fun tptp.msymmetric ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.24/0.56 (assert (= tptp.msymmetric (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted)) (=> (@ (@ R S) T) (@ (@ R T) S))))))
% 0.24/0.56 (declare-fun tptp.mserial ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.24/0.56 (assert (= tptp.mserial (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted)) (exists ((T $$unsorted)) (@ (@ R S) T))))))
% 0.24/0.56 (declare-fun tptp.mtransitive ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.24/0.56 (assert (= tptp.mtransitive (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ (@ R T) U)) (@ _let_1 U)))))))
% 0.24/0.56 (declare-fun tptp.meuclidean ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.24/0.56 (assert (= tptp.meuclidean (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ _let_1 U)) (@ (@ R T) U)))))))
% 0.24/0.56 (declare-fun tptp.mpartially_functional ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.24/0.56 (assert (= tptp.mpartially_functional (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ _let_1 U)) (= T U)))))))
% 35.71/35.97 (declare-fun tptp.mfunctional ((-> $$unsorted $$unsorted Bool)) Bool)
% 35.71/35.97 (assert (= tptp.mfunctional (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted)) (exists ((T $$unsorted)) (and (@ (@ R S) T) (forall ((U $$unsorted)) (=> (@ (@ R S) U) (= T U)))))))))
% 35.71/35.97 (declare-fun tptp.mweakly_dense ((-> $$unsorted $$unsorted Bool)) Bool)
% 35.71/35.97 (assert (= tptp.mweakly_dense (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (=> (@ (@ R S) T) (exists ((U $$unsorted)) (and (@ (@ R S) U) (@ (@ R U) T))))))))
% 35.71/35.97 (declare-fun tptp.mweakly_connected ((-> $$unsorted $$unsorted Bool)) Bool)
% 35.71/35.97 (assert (= tptp.mweakly_connected (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ _let_1 U)) (or (@ (@ R T) U) (= T U) (@ (@ R U) T))))))))
% 35.71/35.97 (declare-fun tptp.mweakly_directed ((-> $$unsorted $$unsorted Bool)) Bool)
% 35.71/35.97 (assert (= tptp.mweakly_directed (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ _let_1 U)) (exists ((V $$unsorted)) (and (@ (@ R T) V) (@ (@ R U) V)))))))))
% 35.71/35.97 (declare-fun tptp.mvalid ((-> $$unsorted Bool)) Bool)
% 35.71/35.97 (assert (= tptp.mvalid (lambda ((Phi (-> $$unsorted Bool))) (forall ((W $$unsorted)) (@ Phi W)))))
% 35.71/35.97 (declare-fun tptp.minvalid ((-> $$unsorted Bool)) Bool)
% 35.71/35.97 (assert (= tptp.minvalid (lambda ((Phi (-> $$unsorted Bool))) (forall ((W $$unsorted)) (not (@ Phi W))))))
% 35.71/35.97 (declare-fun tptp.msatisfiable ((-> $$unsorted Bool)) Bool)
% 35.71/35.97 (assert (= tptp.msatisfiable (lambda ((Phi (-> $$unsorted Bool))) (exists ((W $$unsorted)) (@ Phi W)))))
% 35.71/35.97 (declare-fun tptp.mcountersatisfiable ((-> $$unsorted Bool)) Bool)
% 35.71/35.97 (assert (= tptp.mcountersatisfiable (lambda ((Phi (-> $$unsorted Bool))) (exists ((W $$unsorted)) (not (@ Phi W))))))
% 35.71/35.97 (declare-fun tptp.peter ($$unsorted $$unsorted) Bool)
% 35.71/35.97 (declare-fun tptp.john ($$unsorted $$unsorted) Bool)
% 35.71/35.97 (declare-fun tptp.wife ((-> $$unsorted $$unsorted Bool) $$unsorted $$unsorted) Bool)
% 35.71/35.97 (assert (@ tptp.mreflexive tptp.peter))
% 35.71/35.97 (assert (@ tptp.mreflexive tptp.john))
% 35.71/35.97 (assert (@ tptp.mreflexive (@ tptp.wife tptp.peter)))
% 35.71/35.97 (assert (@ tptp.mtransitive tptp.peter))
% 35.71/35.97 (assert (@ tptp.mtransitive tptp.john))
% 35.71/35.97 (assert (@ tptp.mtransitive (@ tptp.wife tptp.peter)))
% 35.71/35.97 (assert (not (@ tptp.mvalid (@ tptp.mforall_prop (lambda ((A (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (let ((_let_1 (@ tptp.mbox (@ tptp.wife tptp.peter)))) (let ((_let_2 (@ _let_1 A))) (@ (@ (@ tptp.mimplies _let_2) (@ _let_1 _let_2)) __flatten_var_0))))))))
% 35.71/35.97 (set-info :filename cvc5---1.0.5_15389)
% 35.71/35.97 (check-sat-assuming ( true ))
% 35.71/35.97 ------- get file name : TPTP file name is PUZ085^1
% 35.71/35.97 ------- cvc5-thf : /export/starexec/sandbox2/solver/bin/cvc5---1.0.5_15389.smt2...
% 35.71/35.97 --- Run --ho-elim --full-saturate-quant at 10...
% 35.71/35.97 --- Run --ho-elim --no-e-matching --full-saturate-quant at 10...
% 35.71/35.97 --- Run --ho-elim --no-e-matching --enum-inst-sum --full-saturate-quant at 10...
% 35.71/35.97 --- Run --ho-elim --finite-model-find --uf-ss=no-minimal at 5...
% 35.71/35.97 --- Run --no-ho-matching --finite-model-find --uf-ss=no-minimal at 5...
% 35.71/35.97 % SZS status CounterSatisfiable for PUZ085^1
% 35.71/35.97 % cvc5---1.0.5 exiting
% 35.83/35.98 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------